| 1. | Least recently used algorithm based on www navigation processes 浏览过程的最近最少使用算法 |
| 2. | If not , then the least recently used 如果没有,则查找最早使用的 |
| 3. | Caching usually works using a least recently used algorithm 高速缓存通常满足最少最近的运算法则。 |
| 4. | If not , or if more room is needed , then the least recently used 如果没有,或者如果需要更多的空间,则查找最早使用的 |
| 5. | To have the list in access order ; that is , the head of the map is the least recently used map entry ;也即映射表的头部是使用时间距今最远的映射表条目。 |
| 6. | The decision to free up a buffer pool slot is based on the least recently used principle 是否释放一个缓冲池槽,这是根据最近被使用( lru )原则来决定的。 |
| 7. | If the size limit is hit , the least recently used entry is removed in favor of the new one 如果达到大小限制,则至少删除最近使用的条目,以便接受新的条目。 |
| 8. | Through using the patters and rules , the least recently used algorithm is improved 同时利用web数据挖掘所得到的规则,对lru ( leastrecentlyused )算法进行了改进。 |
| 9. | Constructor allows you to keep the linked list for the map in access order , from least recently used to most recently used 构造函数使您能够保持映射表的链表的存取顺序,从使用时间距今最远的到最近使用的。 |
| 10. | The driver may use several algorithms , including the lru least recently used replacement algorithm , to implement the caching scheme 驱动程序可以使用多种算法来实现缓存方案,包括lru (最近最少使用的)替换算法。 |